منابع مشابه
The metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملNote on Metric Dimension
The metric dimension of a compact metric space is defined here as the order of growth of the exponential metric entropy of the space. The metric dimension depends on the metric, but is always bounded below by the topological dimension. Moreover, there is always an equivalent metric in which the metric and topological dimensions agree. This result may be used to define the topological dimension ...
متن کاملAdjacency metric dimension of the 2-absorbing ideals graph
Let Γ=(V,E) be a graph and W_(a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),… ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...
متن کاملOn the metric dimension of convex polytopes ∗
Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let F be a family of connected graphs Gn : F = (Gn)n≥1 depending on n as follows: the order |V (G)| = φ(n) and lim n→∞ φ(n) = ∞ . If there exists a constant C > 0 such that dim(Gn) ≤ C for every n ≥ 1 then we shall say that F has bounded metric dimension. If all graphs in F hav...
متن کاملOn the metric dimension of Grassmann graphs
The metric dimension of a graph Γ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph Gq(n,k) (whose vertices are the k-subspaces of Fq, and are adjacent if they intersect in a (k− 1)-subspace) for k ≥ 2. We find an upper bound on its metric dimension, which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2014
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.09.002